Proof and proving in Algebra

نویسنده

  • Maria Alessandra Mariotti
چکیده

Introduction The theme of proof has been at the core of a number of studies, different aspects have been discussed and different perspectives have been proposed. Although not always researchers found an agreement, certainly some basic ideas can be considered as shared and among others the assumption that proving constitutes an important part of mathematical activity, so that education to mathematical thinking, even if not reduced to formal proving, cannot ignore it. This shared assumption should have and in some cases had (Hoyles, 1997) important consequences on school practice, both in terms of curricula and in terms of classroom organization. Still the didactical problem seems far to be solved. Teachers have troubles introducing pupils to proof and, generally speaking, to a theoretical perspective. The analogy, but also possible discrepancies between a " natural " approach and mathematical approach to argumentation has been widely discussed. Clear evidence has been provided of the difficulties related to the distance between the way of spontaneously supporting a statement and the specific way mathematicians have elaborated in order to make a statement acceptable within a specific theoretical In this perspective, the paper present and discuss on the pupilsìntroduction to proof and it will do it considering an unusual math context for proving, Algebra, and the specific support of a microworld. This contribution is based on a long-term study, carried out in collaboration with Michele Cerulli, who in particular developed a prototype microworld, L'Algebrista (Cerulli, 2004). The aim of this paper is that of discuss on some aspects related to the design of the specific technological environment; in particular, I'd like to discuss how the design of the microworld has been influenced by the basic assumption about its functioning as a tool of semiotic mediation for proving in Algebra, and generally speaking for the idea of Theory. The notion of semiotic mediation, introduced by Vygotsky (1978), has been elaborated in the last years in the field of mathematics education, in particular let me refer to a previous discussion, that I published not long ago (Mariotti, 2002), where the process of semiotic mediation is explained referring to the use of computational tools, and microworlds in particular. The key element on which the process of semiotic mediation is based concerns on the one hand, the link between tools and meanings emerging from their use in classroom activities and on the other hand the mathematical notions, which are the …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A fixed point method for proving the stability of ring $(alpha, beta, gamma)$-derivations in $2$-Banach algebras

In this paper, we first present the new concept of $2$-normed algebra. We investigate the structure of this algebra and give some examples. Then we apply a fixed point theorem to prove the stability and hyperstability of $(alpha, beta, gamma)$-derivations in $2$-Banach algebras.

متن کامل

Proof Planning in

We are building a system that helps us mix proof with computation. On the one hand, theorem proving tools are often good at helping us construct proofs but poor at doing algebraic computations within these proofs. On the other hand, computer algebra systems are good at doing algebraic computations but usually lack the ability to construct proofs. To tackle this problem, we are adding theorem pr...

متن کامل

Guessing a Conjecture in Enumerative Combinatorics and Proving It with a Computer Algebra System

We present a theorem-proving experiment performed with a computer algebra system. It proves a conjecture about the general pattern of the generating functions counting rooted maps of given genus. These functions are characterized by a complex non-linear differential system between generating functions of multi-rooted maps. Establishing a pattern for these functions requires a sophisticated indu...

متن کامل

Proof Automation in Kleene Algebra

It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it has been demonstrated that off-the-shelf automated proof and counterexample search is an interesting alternative if combined with the right domain model. Furthermore it has been shown that variants of Kleene algebra might provi...

متن کامل

RALL: Machine-Supported Proofs for Relation Algebra

We present a theorem proving system for abstract relation algebra called RALL Relation Algebraic Language and Logic based on the generic theorem prover Isabelle On the one hand the system is an advanced case study for Isabelle HOL and on the other hand a quite mature proof assistant for research on the relational calculus RALL is able to deal with the full language of heterogeneous relation alg...

متن کامل

Proof Theory and Algebra in Substructural Logics

It is quite well understood that propositional logics are tightly connected to ordered algebras via algebraic completeness, and because of this connection proof theory is often useful in the algebraic context too. A prominent example is that one deductively proves the interpolation theorem for a given logic in order to derive the algebraic amalgamation property for the corresponding variety as ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005